VAN DEN HEUVEL The Economic Lot - Sizing Problem New Results and Extensions
نویسنده
چکیده
In this chapter we derive a new property for an optimal solution of the economic lotsizing problem with time-invariant cost parameters. We show that the total holding cost in an order interval of an optimal solution is bounded from above by a quantity proportional to the setup cost and the logarithm of the number of periods in the interval. Furthermore, we show how this property may be used for the improvement of existing heuristics and for the development of new heuristics. We propose a new heuristic with worst case ratio 2. Furthermore, we show the relation between the number of setups generated by the heuristic and an optimal procedure.
منابع مشابه
On the complexity of the economic lot-sizing problem with remanufacturing options
In this paper we investigate the complexity of the economic lot-sizing problem with remanufacturing (ELSR) options. Whereas in the classical economic lot-sizing problem demand can only be satisfied by production, in the ELSR problem demand can also be satisfied by remanufacturing returned items. Although the ELSR problem can be solved efficiently for some special cases, we show that the problem...
متن کاملEconomic lot-sizing with remanufacturing: complexity and efficient formulations
Within the framework of reverse logistics, the classic economic lot-sizing problem has been extended with a remanufacturing option. In this extended problem, known quantities of used products are returned from customers in each period. These returned products can be remanufactured, so that they are as good as new. Customer demand can then be fulfilled both from newly produced and remanufactured...
متن کاملWorst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
In this paper we analyze the worst case performance of heuristics for the classical economic lot-sizing problem with time-invariant cost parameters. We consider a general class of on-line heuristics that is often applied in a rolling horizon environment. We develop a procedure to systematically construct worst case instances for a fixed time horizon and use it to derive worst case problem insta...
متن کاملA note on "The economic lot sizing problem with inventory bounds"
In a recent paper, Liu (2008) considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains th...
متن کاملA comparison of methods for lot-sizing in a rolling horizon environment
A comparison of methods for lot-sizing in a rolling horizon environment Wilco van den Heuvel • Albert P.M. Wagelmans Econometric Institute and Erasmus Research Institute of Management, Erasmus University Rotterdam, PO Box 1738, 3000 DR Rotterdam, The Netherlands September 2004 We argue that the superior performance of a recent method for lot-sizing in a rolling horizon scheme is to a large exte...
متن کامل